Convex polytopes all of whose reverse lexicographic initial ideals are squarefree

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Polytopes All of Whose Reverse Lexicographic Initial Ideals Are Squarefree

A compressed polytope is an integral convex polytope any of whose reverse lexicographic initial ideals is squarefree. A sufficient condition for a (0, 1)-polytope to be compressed will be presented. One of its immediate consequences is that the class of compressed (0, 1)-polytopes includes (i) hypersimplices, (ii) order polytopes of finite partially ordered sets, and (iii) stable polytopes of p...

متن کامل

Reverse Lexicographic Initial Ideals of Generic Ideals Are Nitely Generated

This article generalizes the well-known notion of generic forms to the algebra R 0 , introduced in 27]. For the total degree, then reverse lexicographic order, we prove that the initial ideal of an ideal generated by nitely many generic forms (in countably innnitely many variables) is nitely generated. This contrasts to the lexicographic order, for which initial ideals of generic ideals in gene...

متن کامل

Conditions for Generic Initial Ideals to Be Almost Reverse Lexicographic

Let I be a homogeneous Artinian ideal in a polynomial ring R = k[x1, . . . , xn] over a field k of characteristic 0. We study an equivalent condition for the generic initial ideal gin(I) with respect to reverse lexicographic order to be almost reverse lexicographic. As a result, we show that Moreno-Socias conjecture implies Fröberg conjecture. And for the case codimI ≤ 3, we show that R/I has t...

متن کامل

Finite groups all of whose proper centralizers are cyclic

‎A finite group $G$ is called a $CC$-group ($Gin CC$) if the centralizer of each noncentral element of $G$ is cyclic‎. ‎In this article we determine all finite $CC$-groups.

متن کامل

Reverse Lexicographic and Lexicographic Shifting

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆lex — an operation that transforms a monomial ideal of S = k[xi : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2001

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-01-05853-1